Syntactic isomorphism and non-isomorphism under ellipsis

نویسنده

  • Luis Vicente
چکیده

Rooth (1992) and Fiengo and May (1994) argue that elliptical structures are subject to both a semantic and a syntactic parallelism requirement. Pseudosluicing, where an elliptical cleft takes a non-cleft as its antecedent, pose a problem for the idea that there is a syntactic parallelism requirement. In this talk, we will look at Spanish data (building on the analysis of Rodrigues et al. 2008) to show that syntactic parallelism is the default case, and can be overridden only under very specific circumstances. Specifically, syntactic parallelism can be obviated if, by doing so, we create a stronger (more informative) statement with respect to the antecedent clause.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On isomorphism of two bases in Morrey-Lebesgue type spaces

Double system of exponents with complex-valued coefficients is considered. Under some conditions on the coefficients, we prove that if this system forms a basis for the Morrey-Lebesgue type space on $left[-pi , pi right]$, then it is isomorphic to the classical system of exponents in this space.

متن کامل

On Isomorphism Theorems of Fn -Polygroups

In this paper, the notion of fuzzy n-polygroups (Fn -polygroups) is introduced and some related properties are investigated. In this regards, the concepts of normal  F-subpolygroups and homomorphisms of Fn-polygroups are adopted. Also, the quotient of Fn-polygroups by defining regular relations are studied. Finally, the classical isomorphism theorems of groups are generalized to Fn-polygroups p...

متن کامل

Syntactic Isomorphism of CNF Boolean Formulas is Graph Isomorphism Complete

We investigate the complexity of the syntactic isomorphism problem of CNF Boolean Formulas (CSFI): given two CNF Boolean formulas φ(a1, . . . , an) and φ(b1, . . . , bn) decide whether there exists a permutation of clauses, a permutation of literals and a bijection between their variables such that φ(a1, . . . , an) and φ(b1, . . . , bn) become syntactically identical. We first show that the CS...

متن کامل

Distinct Fuzzy Subgroups of a Dihedral Group of Order $2pqrs$ for Distinct Primes $p, , q, , r$ and $s$

In this paper we classify fuzzy subgroups of the dihedral group $D_{pqrs}$  for distinct primes  $p$, $q$, $r$ and $s$. This follows similar work we have done on distinct fuzzy subgroups of some dihedral groups.We present formulae for the number of (i) distinct maximal chains of subgroups, (ii) distinct fuzzy subgroups and (iii) non-isomorphic classes of fuzzy subgroups under our chosen equival...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008